Applying Particle Swarm Optimization for Solving Team Orienteering Problem with Time Windows

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving multi-objective team orienteering problem with time windows using adjustment iterated local search

One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...

متن کامل

Discrete particle swarm optimization for the team orienteering problem

In this paper, a novel discrete particle swarm optimization (PSO) algorithm is proposed to solve the team orienteering problem (TOP). Discrete evaluation is achieved by redefining all operators and operands used in PSO. To obtain better results, a strengthened PSO, which improves both exploration and exploitation during the search process, is employed. Our algorithm achieves the best known solu...

متن کامل

Particle Swarm Optimization for the Orienteering Problem

In this paper, we propose a Particle Swarm Optimization (PSO) based solution to the Orienteering Problem. A major problem in many PSO applications is the premature convergence of some particles to local optimums. To overcome this problem in our application, such particles are re-initiated; consequently, the exploration capability of PSO is improved. Furthermore, by employing Reduced Variable Ne...

متن کامل

The Multiconstraint Team Orienteering Problem with Multiple Time Windows

The Orienteering Problem (OP) is a combinatorial routing problem of which the goal is to find a tour that maximises the total score earned by visiting vertices. A set of vertices is given, determined by their coordinates and a score. The pairwise travel times between the vertices are known. The total travel time should not exceed a predetermined time budget. Each vertex can be visited at most o...

متن کامل

An improved particle swarm optimization with a new swap operator for team formation problem

Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Jurnal Teknik Industri

سال: 2014

ISSN: 2087-7439,1411-2485

DOI: 10.9744/jti.16.1.9-16